Problem:
 f(g(X)) -> f(X)

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {2}
   transitions:
    f1(3) -> 4*
    f0(1) -> 2*
    g0(1) -> 1*
    1 -> 3*
    4 -> 2*
  problem:
   
  Qed